- filling algorithm
- алгоритм насыщения (сводится к добавлению фиктивной нагрузки к матрице нагрузок сети в соответствии с некоторыми условиями, которые из неравенств переходят в равенства)
Англо-русский словарь промышленной и научной лексики. 2014.
filling algorithm
Смотреть что такое "filling algorithm" в других словарях:
Algorithm examples — This article Algorithm examples supplements Algorithm and Algorithm characterizations. = An example: Algorithm specification of addition m+n =Choice of machine model:This problem has not been resolved by the mathematics community. There is no… … Wikipedia
Maze solving algorithm — There are a number of different maze solving algorithms, that is, automated methods for the solving of mazes. A few important maze solving algorithms are explained below. The random mouse, wall follower, Pledge, and Trémaux algorithms are… … Wikipedia
Expectation-maximization algorithm — An expectation maximization (EM) algorithm is used in statistics for finding maximum likelihood estimates of parameters in probabilistic models, where the model depends on unobserved latent variables. EM alternates between performing an… … Wikipedia
Ziggurat algorithm — The ziggurat algorithm is an algorithm to generate random numbers from a non uniform distribution. It belongs to the class of rejection sampling algorithms and can be used for choosing values from a monotone decreasing probability distribution.… … Wikipedia
Generic cell rate algorithm — The generic cell rate algorithm (or GCRA) is an algorithm which measures cell rate at a specified timescale [#REF| [1] . The GCRA is an implementation of the leaky bucket algorithm in ATM networks, and provides a traffic shaping function [#REF|… … Wikipedia
Todd–Coxeter algorithm — In group theory, the Todd–Coxeter algorithm, discovered by J.A. Todd and H.S.M. Coxeter in 1936, is an algorithm for solving the coset enumeration problem. Given a presentation of a group G by generators and relations and a subgroup H of G , the… … Wikipedia
Wang and Landau algorithm — The Wang and Landau algorithm is an extension of Metropolis Monte Carlo sampling.Initially designed for physical systems, the Metropolis Monte Carlo method was based on Boltzmann s insight that at a given temperature molecules are distributed… … Wikipedia
TCP congestion avoidance algorithm — The TCP uses a network congestion avoidance algorithm that includes various aspects of an additive increase multiplicative decrease (AIMD) scheme, with other schemes such as slow start in order to achieve congestion avoidance. TCP Tahoe and Reno… … Wikipedia
Sutherland-Hodgman clipping algorithm — The Sutherland Hodgman algorithm is used for clipping polygons. It works by extending each line of the clip polygon in turn and selecting only vertices from the subject polygon that are on the visible side.DescriptionBegin with a set of all… … Wikipedia
Max-min fairness — In communication networks and multiplexing, a division of the bandwidth resources is said to be max min fair when: firstly, the minimum data rate that a dataflow achieves is maximized; secondly, the second lowest data rate that a dataflow… … Wikipedia
Data and object Carousel — The term Carousel was applied because the content of the transmission stream is provided in a cyclic fashion. Contents 1 History 2 Software Carousel 3 Usage and Applications 4 Carousel Management … Wikipedia
